منابع مشابه
Soft vs. Hard Bounds in Probabilistic Robustness Analysis
The relationship between soft vs. hard bounds and probabilistic vs. worst-case problem formulations for robustness analysis has been a source of some apparent confusion in the control community, and this paper will attempt to clarify some of these issues. Essentially, worst-case analysis involves computing the maximum of a function which measures performance over some set of uncertainty. Probab...
متن کاملOnline Lower Bounds via Duality
In this paper, we exploit linear programming duality in the online setting (i.e., where input arrives on the fly) from the unique perspective of designing lower bounds on the competitive ratio. In particular, we provide a general technique for obtaining online deterministic and randomized lower bounds (i.e., hardness results) on the competitive ratio for a wide variety of problems. We show the ...
متن کاملRobustness Bounds for Matrix -stability
This paper addresses the problem of robust matrix rootclustering analysis. The considered matrices are complex and subject to both polytopic and parameter-dependent normbounded uncertainties. The clustering regions are unions of convex and possibly disjoint and nonsymmetric subregions of the complex plane. The proposed clustering conditions are formulated through an approach based upon Linear M...
متن کاملCapacity bounds and robustness in multipath networks
The recent developments of multipath data transport protocols such as Multipath TCP allow end-systems to explore and share available resources within networks. Through dynamic load balancing over subflows these protocols ensure high levels of robustness to network failures and traffic overloads. In this paper we use fluid models to study the benefits that accrue when load is shared across subfl...
متن کاملOptimal L, Bounds for Disturbance Robustness
The robust disturbance rejection bounds in [11 are tight with respect to the disturbance set that has a specified L , norm bound. This note shows that the robust disturbance rejection bounds in [11 are also tight with respect to a weighted L , disturbance set that has a specified bound on its outer product by choosing a special weight matrix in the L , norm. The matrix can be computed by numeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 1996
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)58208-7